منابع مشابه
Dividing Connected Chores Fairly
In this paper we consider the fair division of chores (tasks that need to be performed by agents, with negative utility for them), and study the loss in social welfare due to fairness. Previous work has been done on this so-called price of fairness, concerning fair division of cakes and chores with non-connected pieces and of cakes with connected pieces. We provide tight or nearly tight bounds ...
متن کاملHow to Re-Divide a Cake Fairly
We study the classic problem of fairly dividing a heterogeneous resource (”cake”) among several agents with different preferences. In our setting, the resource is already divided among several ”old” agents. When ”young” agents come, the resource should be re-divided in a way that is fair both for the young and for the old agents. Motivated by land redivision and other two-dimensional division p...
متن کاملA (fairly) Simple Circuit that (usually) Sorts
This paper provides an analysis of a natural k-round tournament over n = 2' players, and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is exploited by using it as a building block for efficient parallel sorting algorithms under a variety of different models of computation. Three important applications are provided. Fir...
متن کاملA Dividing Stretcher
on it throughout the operation, and when it was over bamboo poles were slid into the hem on each side and two looped iron rods passed over the ends of the poles to keep the stretcher from sagging. The patient was then lifted on to a wheeled carriage and taken to his bed side. Here the difficulty of lifting the patient off the stretcher into bed without any exertion on his part was often very ap...
متن کاملHow to divide a polygon fairly
Let P be a simple polygon with N vertices, each assigned a weight c (0<i<N) with c€{0 , l } . We define the weight C of P as the added weight of its vertices, i.e., C = c 1 +. . . + c A r Making the assumption that the vertices of P have been sorted along some axis -which can be done in 0(Mog AO time-, we prove that it is possible, in O(N) time, to find two vertices a,b in P, such that the segm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1980
ISSN: 0022-247X
DOI: 10.1016/0022-247x(80)90225-5